Perfect Numbers
Introduction
In everyday language, the word perfect suggests something flawless or complete.
In mathematics, the idea is surprisingly similar. A perfect number is a whole number that is exactly equal to the sum of its proper divisors.
A proper divisor of a number is any positive whole number that divides it evenly except the number itself.
For example, the proper divisors of $10$ are $1$, $2$, and $5$ — we leave out $10$.
A number is called perfect if:
- you list all its proper divisors,
- add them up,
- and the total equals the original number.
This idea goes back thousands of years to ancient Greek mathematics, where perfect numbers were admired for their symmetry and balance.
The First Perfect Number: $6$
Let’s look at the number $6$.
Its proper divisors are:
Now add them:
Because the sum equals the number itself, $6$ is a perfect number.
This is the smallest perfect number, and it’s often the first example used to introduce the concept.
The Next Perfect Number: $28$
Now consider $28$.
Its proper divisors are:
Add them:
- $1 + 2 + 4 + 7 + 14 = 28$
Again, the sum matches the number.
So $28$ is also a perfect number.
Why Are Perfect Numbers Interesting?
Perfect numbers are rare and mysterious.
Even though people have studied them for over two thousand years, we still don’t know everything about them. For example:
- Only a few perfect numbers are known.
- All known perfect numbers are even.
- We still don’t know whether any odd perfect numbers exist.
Perfect numbers sit at a crossroads between simple arithmetic and deep mathematical ideas. They show how a basic question — “When do the divisors add up to the number?” — can lead to rich and surprising discoveries.
Formal Definition
Mathematicians often use the Greek letter $\sigma$ (sigma) to represent the sum of divisors function.
It is defined by $$\sigma(n) = \sum_{d \mid n} d,$$ where the symbol $d \mid n$ means “$d$ divides $n$.”
If we want the sum of proper divisors, we simply subtract $n$: $$\sigma(n) - n = \sum_{\substack{d \mid n \\ d < n}} d.$$ Now we can state the formal definition: $$\textbf{A number } n \textbf{ is perfect if } \sigma(n) = 2n,$$ or equivalently, $$\sum_{\substack{d \mid n \\ d < n}} d = n.$$ Both statements say the same thing:
the sum of all proper divisors of $n$ equals $n$ itself.
Deficient and Abundant Numbers
Perfect numbers are special because the sum of their proper divisors matches the number exactly.
But what if the sum is less than the number?
Or greater?
This leads to two related ideas:
Deficient Numbers
A number is called deficient if the sum of its proper divisors is less than the number itself.
Examples:
- $8$ has proper divisors $1$, $2$, and $4$.
Their sum is $1 + 2 + 4 = 7$, which is less than $8$.
So $8$ is deficient. - $10$ has proper divisors $1$, $2$, and $5$.
Their sum is $8$, which is less than $10$.
So $10$ is also deficient.
Most numbers are deficient.
Abundant Numbers
A number is called abundant if the sum of its proper divisors is greater than the number.
Example:
- $12$ has proper divisors $1$, $2$, $3$, $4$, and $6$.
Their sum is $1 + 2 + 3 + 4 + 6 = 16$, which is more than $12$.
So $12$ is abundant.
Abundant numbers are less common than deficient ones, but far more common than perfect numbers.
How These Ideas Fit Together
Every whole number greater than $1$ falls into exactly one of these three categories:
- Deficient (sum of proper divisors is too small)
- Perfect (sum matches exactly)
- Abundant (sum is too large)
Perfect numbers sit right in the middle — a delicate balance between too little and too much.
The Perfect Number Formula
Perfect numbers may look mysterious at first, but there is a beautiful pattern behind every even perfect number.
This pattern was discovered by the ancient Greeks and later proved by the mathematician Euclid.
It gives us a way to construct perfect numbers instead of stumbling upon them by accident.
The Key Idea
Every even perfect number can be written in the form: $$2^{p-1}(2^p - 1)$$ where:
- $p$ is a positive whole number, and
- $2^p - 1$ is prime.
A prime of the form $2^p - 1$ is called a Mersenne prime, named after the French monk Marin Mersenne, who studied them in the 1600s.
So the formula says:
- Even perfect numbers come from Mersenne primes.
If $2^p - 1$ is prime, then $$2^{p-1}(2^p - 1)$$ is guaranteed to be a perfect number.
Why This Works (In Simple Terms)
The formula works because of how the divisors of powers of $2$ behave and how they combine with the divisors of a prime number.
When $2^p - 1$ is prime, the number $2^{p-1}(2^p - 1)$ has a very clean and predictable set of divisors.
When you add them all up, they match the number exactly — the defining property of perfection.
The full proof is more technical, but the heart of it is that the structure of the number forces the divisor sum to come out perfectly balanced.
Examples
Let’s see how the formula produces the first few perfect numbers.
Example 1: $p = 2$
$$2^2 - 1 = 3 \quad \text{(prime)}$$ $$2^{2-1}(3) = 2 \cdot 3 = 6$$ So $6$ is perfect.
Example 2: $p = 3$
$$2^3 - 1 = 7 \quad \text{(prime)}$$ $$2^{3-1}(7) = 4 \cdot 7 = 28$$ So $28$ is perfect.
What This Formula Does Not Tell Us
- It does not tell us whether there are infinitely many perfect numbers.
(We still don’t know.) - It does not help us find odd perfect numbers.
(We don’t even know if any exist.) - It does not guarantee that every $p$ gives a perfect number — only those where $2^p - 1$ is prime.
Why the Formula Matters
This formula is one of the oldest bridges between simple arithmetic and deep number theory.
It connects:
- powers of $2$,
- prime numbers,
- divisor sums, and
- the rare and beautiful perfect numbers.
It also means that discovering a new Mersenne prime automatically gives us a new perfect number — a major event in modern mathematics.
Calculator
Perfect
- Returns the perfect number at the given index
- indices start at 1
perfect(1) perfect(2) perfect(1:10)
Exercises
- List all the proper divisors of $12$. What do they add up to? Is $12$ deficient, perfect, or abundant?
- Find the proper divisors of $20$ and compute their sum. Classify $20$ as deficient, perfect, or abundant.
- The number $18$ has proper divisors $1$, $2$, $3$, $6$, and $9$. Check that $1 + 2 + 3 + 6 + 9 = 21$.
What type of number is $18$? - List the proper divisors of $15$. Do they add up to more than, less than, or equal to $15$?
- Explain in your own words what a “proper divisor” is and why we exclude the number itself.
- Choose any number between $25$ and $40$. Find its proper divisors, add them, and decide whether it is deficient or abundant.
- True or false: every number greater than $1$ has at least one proper divisor.
- A number is called slightly abundant if the sum of its proper divisors is exactly one more than the number. For example, if $n$ had proper divisors summing to $n + 1$, it would be slightly abundant.
Show that no such number can exist by thinking about how divisors pair up. - Challenge: Find a number that is abundant but just barely — meaning the sum of its proper divisors is only a little larger than the number. How close can you get?
- Find the next perfect number after 28
- For a perfect number like $6$ or $28$, something remarkable happens: if you take all of its positive divisors (including the number itself), and add up their reciprocals, the total is exactly $2$. Verify this fact for the perfect number $6$ by listing all its divisors, taking their reciprocals, and showing that the sum is $2$. Then repeat the calculation for the perfect number $28$.
- The reciprocal of $x$ is $\frac1x$